Bohr Cluster Points of Sidon Sets
نویسندگان
چکیده
If there is a Sidon subset of the integers Z which has a member of Z as a cluster point in the Bohr compactification of Z, then there is a Sidon subset of Z which is dense in the Bohr compactification. A weaker result holds for quasiindependent and dissociate subsets of Z. It is a long standing open problem whether Sidon subsets of Z can be dense in the Bohr compactification of Z ([LR]). Yitzhak Katznelson came closest to resolving the issue with a random process in which almost all sets were Sidon and and almost all sets failed to be dense in the Bohr compactification [K]. This note, which does not resolve this open problem, supplies additional evidence that the problem is delicate: it is proved here that if one has a Sidon set which clusters at even one member of Z, one can construct from it another Sidon set which is dense in the Bohr compactification of Z. A weaker result holds for quasi-independent and dissociate subsets of Z. Cluster Points. By the definition of the Bohr topology, a subset E ⊂ Z clusters at q if and only if, for all ∈ R, for all n ∈ Z, and for all (t1, . . . , tn) ∈ T, there is some m ∈ E such that (1) sup 1≤i≤n | < m, ti > − < q, ti > | < . Here T is the dual group of Z and < m, t > denotes the result of the character m acting on t. Thus, if T is represented as [−π, π) with addition mod 2π, < m, t >= e. If, for all (t1, . . . , tn) ∈ T, there is at least one m ∈ E such that inequality (1) holds, then E is said to approximate q within on T. 1991 Mathematics Subject Classification. 43A56.
منابع مشابه
On Partitioning Sidon Sets with Quasi-independent Sets
There is a construction of random subsets of Z in which almost every subset is Sidon (this was first done by Katznelson). More is true: almost every subset is the finite union of quasi-independent sets. Also, if every Sidon subset of Z\{0} is the finite union of quasi-independent sets, then the required number of quasi-independent sets is bounded by a function of the Sidon constant. Analogs of ...
متن کاملThe Sidon Constant for Homogeneous Polynomials
The Sidon constant for the index set of nonzero m-homogeneous polynomials P in n complex variables is the supremum of the ratio between the l norm of the coefficients of P and the H(D) norm of P . We present an estimate which gives the right order of magnitude for this constant, modulo a factor depending exponentially on m. We use this result to show that the Bohr radius for the polydisc D is b...
متن کاملResults on Sidon and B h Sequences
Results on Sidon and Bh Sequences Sangjune Lee A set A of non-negative integers is a Sidon set if all the sums a1 + a2, with a1 ≤ a2 and a1, a2 ∈ A, are distinct. In this dissertation, we deal with results on the number of Sidon sets in [n] = {0, 1, · · · , n − 1} and the maximum size of Sidon sets in sparse random subsets of [n] or N (the set of natural numbers). We also consider a natural gen...
متن کاملThe number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers
A set A of non-negative integers is called a Sidon set if all the sums a1+a2, with a1 ≤ a2 and a1, a2 ∈ A, are distinct. A well-known problem on Sidon sets is the determination of the maximum possible size F (n) of a Sidon subset of [n] = {0, 1, . . . , n− 1}. Results of Chowla, Erdős, Singer and Turán from the 1940s give that F (n) = (1 + o(1)) √ n. We study Sidon subsets of sparse random sets...
متن کاملThe Number of Sidon Sets and the Maximum Size of Sidon
A set A of non-negative integers is called a Sidon set if all the sums a1+a2, with a1 ≤ a2 and a1, a2 ∈ A, are distinct. A well-known problem on Sidon sets is the determination of the maximum possible size F (n) of a Sidon subset of [n] = {0, 1, . . . , n− 1}. Results of Chowla, Erdős, Singer and Turán from the 1940s give that F (n) = (1 + o(1)) √ n. We study Sidon subsets of sparse random sets...
متن کامل